An iterative deautoconvolution algorithm for nonnegative functions
نویسندگان
چکیده
Abstract. This paper considers the inverse problem of recovering a nonnegative function from its autoconvolution. We propose an algorithm that solves the problem by minimizing Csiszár’s I-divergence between the observed autoconvolution and an estimated autoconvolution. We call it a deautoconvolution algorithm. Various properties of the algorithm are discussed and proven. The effectiveness of the algorithm is illustrated via numerical experiments.
منابع مشابه
Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملAn iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach
Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملNonnegative Matrix Factorization without Nonnegativity Constraints on the Factors
Abstract. We consider a new kind of low rank matrix approximation problem for nonnegative matrices: given a nonnegative matrix M , approximate it with a low rank product V.H such that V.H is nonnegative, but without nonnegativity constraints on V and H separately. The nonnegativity constraint on V.H is natural when using the Kullback-Leibler divergence as optimality criterion. We propose an ite...
متن کاملAn iterative procedure to solve HJBI
In this paper, an iterative algorithm to solve a special class of Hamilton-JacobiBellman-Isaacs (HJBI) equations is proposed. By constructing two series of nonnegative functions, we replace the problem of solving an HJBI equation by the problem of solving a sequence of Hamilton-Jacobi-Bellman (HJB) equations whose solutions can be approximated recursively by existing methods. The local converge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005